Analysis of finite element methods for the Brinkman problem
نویسندگان
چکیده
منابع مشابه
A Dual–mixed Finite Element Method for the Brinkman Problem
A mixed variational formulation of the Brinkman problem is presented which is uniformly well–posed for degenerate (vanishing) coefficients under the hypothesis that a generalized Poincaré inequality holds. The construction of finite element schemes which inherit this property is then considered.
متن کاملUniformly-stable Finite Element Methods for Darcy-stokes-brinkman Models
In this paper, we consider 2D and 3D Darcy-Stokes interface problems. These equations are related to Brinkman model that treats both Darcy’s law and Stokes equations in a single form of PDE but with strongly discontinuous viscosity coefficient and zerothorder term coefficient. We present three different methods to construct uniformly stable finite element approximations. The first two methods a...
متن کاملFinite Element Methods for Convection Diffusion Equation
This paper deals with the finite element solution of the convection diffusion equation in one and two dimensions. Two main techniques are adopted and compared. The first one includes Petrov-Galerkin based on Lagrangian tensor product elements in conjunction with streamlined upwinding. The second approach represents Bubnov/Petrov-Galerkin schemes based on a new group of exponential elements. It ...
متن کاملFinite Element Methods for Biharmonic Problem
and Applied Analysis 3 Let EI and EB be the set of interior edges and boundary edges of Th, respectively. Let E EI ∪ EB. Denote by v the restriction of v to Ki. Let e eij ∈ EI with i > j. Then we denote the jump v and the average {v} of v on e by v |e v ∣ ∣ ∣ e −v ∣ ∣ ∣ e , {v}|e 1 2 ( v ∣ ∣ ∣ e v ∣ ∣ ∣ e ) . 2.4 If e ei ∈ EB, we denote v and {v} of v on e by v |e {v}|e v ∣ ∣ ∣ e . 2.5
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Calcolo
سال: 2009
ISSN: 0008-0624,1126-5434
DOI: 10.1007/s10092-009-0017-6